Competitive paging algorithms
نویسندگان
چکیده
منابع مشابه
Competitive Paging Algorithms
*Department of Computer Science, Tel Aviv University, Tel Aviv, Israel 69978; ‘Department of Electrical Engineetig and Computer Science, Computer Science Division, University of California, Berkeley, CA 94720; ‘Department of Computer Science, University of Toronto, Toronto, Ontario, Canada M6C 3B7; ‘Department of Mathematics and Computer Science, Amherst College, Amherst, Massachusetts 01002; “...
متن کاملCompetitive Paging Algorithms AMOS FIAT
The paging problem is that of deciding which pages to keep in a memory of k pages in order to minimize the number of page faults. We develop the marking algorithm, a randomized on-line algorithm for the paging problem. We prove that its expected cost on any sequence of requests is within a factor of 2Hk of optimum. (Where Hk is the kth harmonic number, which is roughly Ink.) The best such facto...
متن کاملImproved Space Bounds for Strongly Competitive Randomized Paging Algorithms
Paging is a prominent problem in the field of online algorithms. While in the deterministic setting there exist simple and efficient strongly competitive algorithms, in the randomized setting a tradeoff between competitiveness and memory is still not settled. In this paper we address the conjecture in [2], that there exist strongly competitive randomized paging algorithms using o(k) bookmarks, ...
متن کاملThe Influence of Lookahead in Competitive Paging Algorithms (Extended Abstract)
Efficient Self Simulation Algorithms for Reconfigurable Arrays p. 25 Optimal Upward Planarity Testing of Single-Source Digraphs p. 37 On Bufferless Routing of Variable-Length Messages in Leveled Networks p. 49 Saving Comparisons in the Crochemore-Perrin String Matching Algorithm p. 61 Unambiguity of Extended Regular Expressions in SGML Document Grammars p. 73 On the Direct Sum Conjecture in the...
متن کاملCompetitive Algorithms for On-line Paging and Graph Coloring
A class of algorithms that require nonlinear time to maintaing disjoint sets.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algorithms
سال: 1991
ISSN: 0196-6774
DOI: 10.1016/0196-6774(91)90041-v